Multimodal estimation of discontinuous optical flow using Markov random fields
نویسندگان
چکیده
منابع مشابه
Multimodal Estimation of Discontinuous Optical Flow using Markov Random Fields
The estimation of dense velocity fields from image sequences is basically an ill-posed problem, primarily because the data only partially constrain the solution. It is rendered especially difficult by the presence of motion boundaries and occlusion regions which are not taken into account by standard regularization approaches. In this paper, we present a multimodal approach to the problem of mo...
متن کاملMarkov random fields and the optical flow
Abstract: The optical flow can be viewed as the assignment problem between the pixels of consecutive video frames. The problem to determine the optical flow is addressed for many decades because of its central relevance. This paper gives a short resume about classical methods. Afterwards advanced Markov random fields are developed. The challenge and beauty of this approach consists of the large...
متن کاملParameter Estimation for Inhomogeneous Markov Random Fields Using PseudoLikelihood
We describe an algorithm for locally-adaptive parameter estimation of spatially inhomogeneous Markov random elds (MRFs). In particular, we establish that there is a unique solution which maximizes the local pseudo-likelihood in the inhomogeneous MRF model. Subsequently we demonstrate how Besag's iterative conditional mode (ICM) procedure can be generalized from homogeneous MRFs to inhomogeneous...
متن کاملMultiple-Motion-Estimation by Block-Matching Using Markov Random Fields
This paper deals with the problem of estimating multiple motions at points where these motions are overlaid. We present a new approach that is based on block-matching and can deal with both transparent motions and occlusions. We derive a block-matching constraint for an arbitrary number of moving layers. We use this constraint to design a hierarchical algorithm that can distinguish between the ...
متن کاملEfficient Parallel Estimation for Markov Random Fields
We present a new , deterministic, distributed MAPes timation algorithm for Markov Random Fields called Local Highest Confidence First (Local HCF). The al gorithm has been applied to segmentation problems in computer vision and its performance compared with stochastic algorithms. The experiments show that Local HCF finds better estimates than stochas tic algorithms with much less computation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 1993
ISSN: 0162-8828
DOI: 10.1109/34.250841